Comparison of Point Sets and Sequences for Quasi-Monte Carlo and for Random Number Generation
نویسنده
چکیده
Algorithmic random number generators require recurring sequences with very long periods and good multivariate uniformity properties. Point sets and sequences for quasi-Monte Carlo numerical integration need similar multivariate uniformity properties as well. It then comes as no surprise that both types of applications share common (or similar) construction methods. However, there are some differences in both the measures of uniformity and the construction methods used in practice. We briefly survey these methods and explain some of the reasons for the differences.
منابع مشابه
Quasi-random Number Generation in the View of Parallel Implementation
Pseudo-random number sequences have been used in Monte Carlo methods in wide areas of science and engineer. Recently, quasi-random number sequences having uniform distribution property are used in numerical integrations, particle transport problems, financial problems and so on. Here, I survey on the quasi-random number generation and its applications. At the end, I discuss about the possible i...
متن کاملFaster Quasi Random Number Generator for Most Monte Carlo Simulations
Generating quasi-random sequences for Monte Carlo simulations has been proved of interest when comparing results with numbers coming from conventional pseudorandom sequences. Despite a fair amount of sound theoretical work on random number generation algorithms, theoretical gain is often eradicated by poor computer implementations. Recently, one of the authors of this paper showed that massive ...
متن کاملQuasi-Monte Carlo Node Sets from Linear Congruential Generators
In this paper we present a new approach to nding good lattice points. We employ the spectral test, a well-known gure of merit for uniform random number generators. This concept leads to an assessment of lattice points g that is closely related to the classical Babenko-Zaremba quantity (g; N). The associated lattice rules are good uniformly over a whole range of dimensions. Our numerical example...
متن کاملLow-discrepancy sequences for volume properties in solid modelling
This paper investigates the use of low-discrepancy sequences for computing volume integrals in geometric modelling. An introduction to low-discrepancy point sequences is presented which explains how they can be used to replace random points in Monte Carlo methods. The relative advantages of using low-discrepancy methods compared to random point sequences are discussed theoretically, and then pr...
متن کاملExploring multi-dimensional spaces: a Comparison of Latin Hypercube and Quasi Monte Carlo Sampling Techniques
Three sampling methods are compared for efficiency on a number of test problems of various complexity for which analytic quadratures are available. The methods compared are Monte Carlo with pseudo-random numbers, Latin Hypercube Sampling, and Quasi Monte Carlo with sampling based on Sobol’ sequences. Generally results show superior performance of the Quasi Monte Carlo approach based on Sobol’ s...
متن کامل